Worst-case optimal approximation with increasingly flat Gaussian kernels
نویسندگان
چکیده
منابع مشابه
Nonlinear Approximation Using Gaussian Kernels
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no s...
متن کاملAverage Case Approximation: Convergence and Tractability of Gaussian Kernels
We study the problem of approximating functions of d variables in the average case setting for a separable Banach space Fd equipped with a zero-mean Gaussian measure. The covariance kernel of this Gaussian measure takes the form of a Gaussian that depends on shape parameters γl. We stress that d can be arbitrarily large. Our approximation error is defined in the L2 norm, and we study the minima...
متن کاملPolynomial Bases for Optimal Worst Case Approximation of Nonlinearities
Several identification and control problems present nonlinearities that cannot be neglected and are often approximated by polynomials. In some previous works optimal set of interpolation nodes that minimizes the uncertainties of the approximation have been derived for the Vandermonde base that, however, can lead to ill-conditioned numerical problems. In this paper the conditions under which pol...
متن کاملGeodesic Gaussian kernels for value function approximation
The least-squares policy iteration approach works efficiently in value function approximation, given appropriate basis functions. Because of its smoothness, the Gaussian kernel is a popular and useful choice as a basis function. However, it does not allow for discontinuity which typically arises in real-world reinforcement learning tasks. In this paper, we propose a new basis function based on ...
متن کاملWorst - Case - Optimal Anytime
Coalition formation is one of the key problems in mul-tiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions , but often the number of coalition structures is too large to allow exhaustive search for the optimal one. This paper focuses on nding a worst case bound on how good the optimal coalition structure is compared to the best coalition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2020
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-020-09767-1